Using Reference Counters in Update-Based Coherent Memory
نویسندگان
چکیده
As the disparity between processor and memory speed continues to widen the exploita tion of locality of reference in shared memory multiprocessors becomes an increasingly important problem in parallel processing In this paper we explore the problem of managing locality at the operating system level In speci c we study the use of reference counters in making informed deci sions about page placement and movement We use trace driven simulation of real applications to evaluate the e ectiveness of reference counters in providing useful hints to the memory manager of the operating system Our main conclusion is that reference counters provide a simple and inex pensive mechanism for detecting the reference patterns of pages and making robust page placement decisions that result in signi cant performance improvement
منابع مشابه
F-STONE: A Fast Real-Time DDOS Attack Detection Method Using an Improved Historical Memory Management
Distributed Denial of Service (DDoS) is a common attack in recent years that can deplete the bandwidth of victim nodes by flooding packets. Based on the type and quantity of traffic used for the attack and the exploited vulnerability of the target, DDoS attacks are grouped into three categories as Volumetric attacks, Protocol attacks and Application attacks. The volumetric attack, which the pro...
متن کاملA Network Device Stores and Updates Statistics Counters. Using an Optimal Counter Management Algorithm Minimizes Required Sram Size and Ensures Correct Line-rate Operation for Many Counters
Packet switches (that is, IP routers and ATM and Ethernet switches) maintain statistics for performance monitoring, network management, security, network tracing, and traffic engineering. Counters usually collect such statistics as the number of arrivals of a specific packet type or they count a particular event, such as when the network drops a packet. A packet’s arrival can lead to the updati...
متن کاملWaitfree Distributed Memory Management by Create, and Read until Deletion (crud)
The acronym CRUD represents an interface speciication and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modiied by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic ...
متن کاملTrace-Driven Simulation of Data-Alignment and Ohter Factors Affecting Update and Invalidate Based Coherent Memory
The exploitation of locality of reference in shared memory multiprocessors is one of the most important problems in parallel processing today. Locality can be managed in several levels: hardware, operating system , runtime environment of the compiler, user level. In this paper we investigate the problem of exploiting locality at the operating system level and its interactions with the compiler ...
متن کاملCentrum Voor Wiskunde En Informatica Reportrapport Waitfree Distributed Memory Management by Create, and Read until Deletion (crud) Waitfree Distributed Memory Management by Create, and Read until Deletion Crud
The acronym CRUD represents an interface speci cation and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modi ed by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994